Tree Decomposition based Steiner Tree Computation over Large Graphs
نویسنده
چکیده
In this paper, we present an exact algorithm for the Steiner tree problem. The algorithm is based on certain pre-computed index structures. Our algorithm offers a practical solution for the Steiner tree problems on graphs of large size and bounded number of terminals.
منابع مشابه
A Solution Merging Heuristic for the Steiner Problem in Graphs Using Tree Decompositions
Fixed parameter tractable algorithms for bounded treewidth are known to exist for a wide class of graph optimization problems. While most research in this area has been focused on exact algorithms, it is hard to find decompositions of treewidth sufficiently small to make these algorithms fast enough for practical use. Consequently, tree decomposition based algorithms have limited applicability ...
متن کاملParallel Greedy Adaptive Search Algorithm for Steiner Tree Problem
In this paper, a parallel algorithm for the Steiner tree problem is presented. The algorithm is based on the well-known multi-start paradigm the GRASP and the well-known proximity structures from computational geometry. The main contribution of this paper is the O(n log n+log n log( n log n )) parallel algorithm for computing Steiner tree on the Euclidean plane. The parallel algorithm used prox...
متن کاملDomination problems on trees and their homogeneous extensions
A graph is a homogeneous extension of a tree iff the reduction of all homogeneous sets (sometimes called modules) to single vertices gives a tree. We show that these graphs can be recognized in linear sequential and polylogarithmic parallel time using modular decomposition. As an application of some results on homogeneous sets we present a linear time algorithm computing the vertex sets of the ...
متن کاملTransformations for the Prize-Collecting Steiner Tree Problem and the Maximum-Weight Connected Subgraph Problem to SAP
Transformations of Steiner tree problem variants have been frequently discussed in the literature. Besides allowing to easily transfer complexity results, they constitute a central pillar of exact state-of-the-art solvers for well-known variants such as the Steiner tree problem in graphs. In this paper transformations for both the prize-collecting Steiner tree problem and the maximum-weight con...
متن کاملSolving a tri-objective convergent product network using the Steiner tree
Considering convergent product as an important manufacturing technology for digital products, we integrate functions and sub-functions using a comprehensive fuzzy mathematical optimization process. To form the convergent product, a web-based fuzzy network is considered in which a collection of base functions and sub-functions configure the nodes and each arc in the network is to be a link betwe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1305.5757 شماره
صفحات -
تاریخ انتشار 2013